Extended Failed-Literal Preprocessing for Quantified Boolean Formulas
نویسندگان
چکیده
ion makes Φ “truer” (more tree models). Pure existential literal rule makes Φ “falser” (fewer tree models). Pure universal literal rule makes Φ “falser” (fewer tree models). Unit-clause propagation and universal reduction do not change the set of tree models. So ? ? ? If abstraction changes u from universal to existential, and then it becomes pure, making it true is the wrong idea. Say u is assigned true due to purity. u cannot imply anything by unit propagation. But u can make some universal literal, say v, become pure. This combination is unsound. Experimental Results (more details in proceedings) Extended QxBF adds 1-saturation with pure universal literal rule to QxBF. Combine exqbf and bloqqer (Biere, Seidl, Lonsing, CADE 2011). Run multiple rounds so bloqqer can digest exqbf results. depqbf is the back-end solver. 0 200 400 600 80
منابع مشابه
Blocked Literals Are Universal
We recently introduced a new proof system for Quantified Boolean Formulas (QBF), called QRAT, that opened up a variety of new preprocessing techniques. This paper presents a concept that follows from the QRAT proof system: blocked literals. Blocked literals are redundant universal literals that can be removed or added to clauses. We show that blocked literal elimination (BLE) and blocked litera...
متن کاملA Little Blocked Literal Goes a Long Way
Q-resolution is a generalization of propositional resolution that provides the theoretical foundation for search-based solvers of quantified Boolean formulas (QBFs). Recently, it has been shown that an extension of Q-resolution, called long-distance resolution, is remarkably powerful both in theory and in practice. However, it was unknown how long-distance resolution is related to QRAT, a proof...
متن کاملFailed Literal Detection for QBF
Failed literal detection (FL) in SAT is a powerful approach for preprocessing. The basic idea is to assign a variable as assumption. If boolean constraint propagation (BCP) yields an empty clause then the negated assumption is necessary for satisfiability. Whereas FL is common in SAT, it cannot easily be applied to QBF due to universal quantification. We present two approaches for FL to preproc...
متن کاملA Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas
Let F = Qlxr Qzxz l ** Qnx, C be a quantified Boolean formula with no free variables, where each Qi is either 3 or t, and C is in conjunctive normal form. That is, C is a conjunction of clauses, each clause is a disjunction of literals, and each literal is either a variable, xi, or the negation of a variable, Zi (1 < i f n). We shall use Ui to denote a literal equal to either Xi or Fi. The eval...
متن کاملThe threshold for random (1,2)-QSAT
The QSAT problem is the quantified version of the SAT problem. We show the existence of a threshold effect for the phase transition associated with the satisfiability of random quantified extended 2-CNF formulas. We consider boolean CNF formulas of the form ∀X∃Y ϕ(X, Y), where X has m variables, Y has n variables and each clause in ϕ has one literal from X and two from Y. For such formulas , we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012